Extra Space during Initialization of Succinct Data Structures and of Dynamical Initializable Arrays
نویسندگان
چکیده
Many succinct data structures on a word RAM require precomputed tables to start operating. Usually, the tables can be constructed in sublinear time. In this time, most of the data structure is not initialized, i.e., there is plenty of unused space allocated for the data structure. We present a general framework to store temporary extra buffers between the real data so that data can be processed immediately, stored first in the buffers and then moved into the real data structure after finishing the tables. As a further application of our temporary extra buffers, we present an in-place dynamical initializable array. 1998 ACM Subject Classification F.2.2 Nonnumerical Algorithms and Problems
منابع مشابه
In-Place Initializable Arrays
Initializing all elements of a given array to a specified value is basic operation that frequently appears in numerous algorithms and programs. Initializable arrays are abstract arrays that support initialization as well as reading and writing of any element of the array in constant worst case time. On the word RAM model, we propose an in-place algorithm which implements an initializable array ...
متن کاملDynamical distance as a semi-metric on nuclear conguration space
In this paper, we introduce the concept of dynamical distance on a nuclear conguration space. We partition the nuclear conguration space into disjoint classes. This classification coincides with the classical partitioning of molecular systems via the concept of conjugacy of dynamical systems. It gives a quantitative criterion to distinguish dierent molecular structures.
متن کاملSuccinct Data Structures for NLP-at-Scale
Succinct data structures involve the use of novel data structures, compression technologies, and other mechanisms to allow data to be stored in extremely small memory or disk footprints, while still allowing for efficient access to the underlying data. They have successfully been applied in areas such as Information Retrieval and Bioinformatics to create highly compressible in-memory search ind...
متن کاملSuccinct Representation of Triangulations with a Boundary
We consider the problem of designing succinct geometric data structures while maintaining efficient navigation operations. A data structure is said succinct if the asymptotic amount of space it uses matches the entropy of the class of structures represented. For the case of planar triangulations with a boundary we propose a succinct representation of the combinatorial information that improves ...
متن کاملSuccinct and Implicit Data Structures for Computational Geometry
Many classic data structures have been proposed to support geometric queries, such as range search, point location and nearest neighbor search. For a two-dimensional geometric data set consisting of n elements, these structures typically require O(n), close to O(n) or O(n lg n) words of space; while they support efficient queries, their storage costs are often much larger than the space require...
متن کامل